On Elementary Computability-Theoretic Properties of Algorithmic Randomness
نویسنده
چکیده
In this paper we apply some elementary computability-theoretic notions to algorithmic complexity theory with the aim of understanding the role and extent of computability techniques for algorithmic complexity theory. We study some computability-theoretic properties of two different notions of randomness for finite strings: randomness based on the blank-endmarker complexity measure and Chaitin’s randomness based on the self-delimiting complexity measure. We introduce the notion of complex infinite sequence of finite strings, which we call K-bounded sequences.
منابع مشابه
Randomness – beyond Lebesgue Measure
Much of the recent research on algorithmic randomness has focused on randomness for Lebesgue measure. While, from a computability theoretic point of view, the picture remains unchanged if one passes to arbitrary computable measures, interesting phenomena occur if one studies the the set of reals which are random for an arbitrary (continuous) probability measure or a generalized Hausdorff measur...
متن کاملComputability and information in models of randomness and chaos
This paper presents a short survey of some recent approaches relating different areas: deterministic chaos and computability. Chaos, in classical physics, may be approached by dynamical (equationally determined) systems or stochastic ones (as random processes). Now, randomness has also been effectively modeled with recursion theoretic tools by P. Martin-Löf. We recall its connections to Kolmogo...
متن کاملAlgorithmic Randomness and Computability
We examine some recent work which has made significant progress in out understanding of algorithmic randomness, relative algorithmic randomness and their relationship with algorithmic computability and relative algorithmic computability. Mathematics Subject Classification Primary 68Q30, 68Q15, 03D15, 03D25, 03D28, 03D30.
متن کاملExtending and interpreting Post's programme
Computability theory concerns information with a causal – typically algorithmic – structure. As such, it provides a schematic analysis of many naturally occurring situations. Emil Post was the first to focus on the close relationship between information, coded as real numbers, and its algorithmic infrastructure. Having characterised the close connection between the quantifier type of a real and...
متن کاملComputability of probability measures and Martin-Lof randomness over metric spaces
In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show that any computable metric space with a computable probability measure is isomorphic to the Cantor space in a computable and measure-theoretic sense. We show th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 42 شماره
صفحات -
تاریخ انتشار 2001